Faster Sorting Networks for $17$, $19$ and $20$ Inputs
نویسندگان
چکیده
We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs these new networks are faster (i.e., they require less computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on 17, 19, and 20 channels. The networks were obtained using a combination of hand-crafted first layers and a SAT encoding of sorting networks.
منابع مشابه
New Bounds on Optimal Sorting Networks
We present new parallel sorting networks for 17 to 20 inputs. For 17, 19, and 20 inputs these new networks are faster (i.e., they require less computation steps) than the previously known best networks. Therefore, we improve upon the known upper bounds for minimal depth sorting networks on 17, 19, and 20 channels. Furthermore, we show that our sorting network for 17 inputs is optimal in the sen...
متن کاملSorting Networks: to the End and Back Again
This paper studies new properties of the front and back ends of a sorting network, and illustrates the utility of these in the search for new bounds on optimal sorting networks. Search focuses first on the “outsides” of the network and then on the inner part. All previous works focus only on properties of the front end of networks and on how to apply these to break symmetries in the search. The...
متن کاملOptimal-Depth Sorting Networks
We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of “The Art of Computer Programming”, sorting networks of the smallest depth known at the time for n ≤ 16 inputs, quoting optimality for n ≤ 8. In 1989, Parberry proved the optimality of the networks with 9 ≤ n ≤ 10 inputs. In this article, we present a general techniq...
متن کاملOptimal Sorting Networks
This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n ≤ 16 inputs. In this paper we give general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form. We then construct propositional formulas whose satis...
متن کاملFast Periodic Correction Networks
We consider the problem of sorting N-element inputs differing from already sorted sequences on t entries. To perform this task we construct a comparator network that is applied periodically. The two constructions for this problem made by previous authors required O(logn+ t) iterations of the network. Our construction requires O(logn + (log logN)2(log t)3) iterations which makes it faster for t ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1410.2736 شماره
صفحات -
تاریخ انتشار 2014